Linear sets on the projective line with complementary weights
نویسندگان
چکیده
Linear sets on the projective line have attracted a lot of attention because their link with blocking sets, KM-arcs and rank-metric codes. In this paper, we study linear having two points complementary weight, that is, for which sum weights equals rank set. As special case, those exactly weight greater than one, by showing new examples studying equivalence issue. Also, determine some linearized polynomials defining recently introduced Jena Van de Voorde [30].
منابع مشابه
On linear sets on a projective line
Linear sets generalise the concept of subgeometries in a projective space. They have many applications in finite geometry. In this paper we address two problems for linear sets: the equivalence problem and the intersection problem. We consider linear sets as quotient geometries and determine the exact conditions for two linear sets to be equivalent. This is then used to determine in which cases...
متن کاملon the effect of linear & non-linear texts on students comprehension and recalling
چکیده ندارد.
15 صفحه اولDuality and Greedy Weights of Linear Codes and Projective Multisets
A projective multiset is a collection of projective points, which are not necessarily distinct. A linear code can be represented as a projective multiset, by taking the columns of a generator matrix as projective points. Projective multisets have proved very powerful in the study of generalised Hamming weights. In this paper we study relations between a code and its dual.
متن کاملOn the Convexity of Projective, Smooth Sets
Let us assume every Chebyshev matrix is bounded and multiply Poisson. Recent developments in absolute graph theory [14] have raised the question of whether V −1 (C −∞) ⊂ ∑ ξ (∅+ π, . . . , ∅ ∨ i) . We show that |τ̄ | 6= −1. A central problem in advanced algebra is the derivation of Tate fields. This could shed important light on a conjecture of Desargues.
متن کاملLinear nonbinary covering codes and saturating sets in projective spaces
Let AR,q denote a family of covering codes, in which the covering radius R and the size q of the underlying Galois field are fixed, while the code length tends to infinity. The construction of families with small asymptotic covering densities is a classical problem in the area Covering Codes. In this paper, infinite sets of families AR,q, where R is fixed but q ranges over an infinite set of pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2022
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2022.112890